Some Large Scale Matrix Computation Problems
نویسندگان
چکیده
There are numerous applications in physics, statistics and electrical circuit simulation where it is required to bound entries and the trace of the inverse and the determinant of a large sparse matrix. All these computational tasks are related to the central mathematical problem studied in this paper, namely, bounding the bilinear form uXf(A)v for a given matrix A and vectors u and v, wheref is a given smooth function and is defined on the spectrum of A. We will study a practical numerical algorithm for bounding the bilinear form, where the matrix A is only referenced through matrix-vector multiplications. A Monte Carlo method is also presented to efficiently estimate the trace of the inverse and the determinant of a large sparse matrix.
منابع مشابه
A Randomized Mirror-Prox Method for Solving Structured Large-Scale Matrix Saddle-Point Problems
In this paper, we derive a randomized version of the Mirror-Prox method for solving some structured matrix saddle-point problems, such as the maximal eigenvalue minimization problem. Deterministic first-order schemes, such as Nesterov’s Smoothing Techniques or standard Mirror-Prox methods, require the exact computation of a matrix exponential at every iteration, limiting the size of the problem...
متن کاملیک نگرش ترکیب سطوح برای تخمین ماتریس مبدأ و مقصد در شبکههای بزرگ مقیاس
Transportation problems are usually considered in large-scale networks, where finding the optimal solution of these problems is so time-consuming and costly. Therefore, a useful method to solve the large-scale network problems is dividing them into some smaller sub-problems. In this paper, for the first time, the origin-destination (o-d) matrix estimation problem is considered through a mixed p...
متن کاملComputation of Large-Scale Quadratic Form and Transfer Function Using the Theory of Moments, Quadrature and Padé Approximation
Large-scale problems in scientific and engineering computing often require solutions involving large-scale matrices. In this paper, we survey numerical techniques for solving a variety of large-scale matrix computation problems, such as computing the entries and trace of the inverse of a matrix, computing the determinant of a matrix, and computing the transfer function of a linear dynamical sys...
متن کاملReview of two vector extrapolation methods of polynomial type with applications to large-scale problems
An important problem that arises in different areas of science and engineering is that of computing limits of sequences of vectors {xn}, where xn ∈CN with N very large. Such sequences arise, for example, in the solution of systems of linear or nonlinear equations by fixed-point iterative methods, and limn→∞xn are simply the required solutions. Inmost casesof interest, these sequences converge t...
متن کاملSolving infinite horizon optimal control problems of nonlinear interconnected large-scale dynamic systems via a Haar wavelet collocation scheme
We consider an approximation scheme using Haar wavelets for solving a class of infinite horizon optimal control problems (OCP's) of nonlinear interconnected large-scale dynamic systems. A computational method based on Haar wavelets in the time-domain is proposed for solving the optimal control problem. Haar wavelets integral operational matrix and direct collocation method are utilized to find ...
متن کاملLoad balancing in pre-processing of large-scale distributed sparse computation
In this paper, we study the sparse matrix-vector product (SMVP) distribution on a large scale distributed system (LSDS). The framework is defined by three steps: pre-processing, processing and post processing. We focus here only on the first step i.e. pre-processing. Our general goal is to detect, for a given sparse matrix, the best compression format i.e. which leads to the best performances f...
متن کامل